Erratum to: Adaptive matching pursuit with constrained total least squares
نویسندگان
چکیده
After publication of our work [1], we noticed that equations (41) and (42) (in Appendix 1) were incorrect. This does not affect resulting equations. The correct equations are below:
منابع مشابه
Adaptive matching pursuit with constrained total least squares
Compressive sensing (CS) can effectively recover a signal when it is sparse in some discrete atoms. However, in some applications, signals are sparse in a continuous parameter space, e.g., frequency space, rather than discrete atoms. Usually, we divide the continuous parameter into finite discrete grid points and build a dictionary from these grid points. However, the actual targets may not exa...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملOn the Difference Between Orthogonal Matching Pursuit and Orthogonal Least Squares
Greedy algorithms are often used to solve underdetermined inverse problems when the solution is constrained to be sparse, i.e. the solution is only expected to have a relatively small number of non-zero elements. Two different algorithms have been suggested to solve such problems in the signal processing and control community, orthogonal Matching Pursuit and orthogonal Least Squares respectivel...
متن کاملIterative Nearest Neighbors
Representing data as a linear combination of a set of selected known samples is of interest for various machine learning applications such as dimensionality reduction or classification. k-Nearest Neighbors (kNN) and its variants are still among the best-known and most often used techniques. Some popular richer representations are Sparse Representation (SR) based on solving an l1-regularized lea...
متن کاملUnderdetermined Wideband DOA Estimation for Off-Grid Sources with Coprime Array Using Sparse Bayesian Learning
Sparse Bayesian learning (SBL) is applied to the coprime array for underdetermined wideband direction of arrival (DOA) estimation. Using the augmented covariance matrix, the coprime array can achieve a higher number of degrees of freedom (DOFs) to resolve more sources than the number of physical sensors. The sparse-based DOA estimation can deteriorate the detection and estimation performance be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015